Keywords : dispatching rules, theory of constraints, system resources, profit 关键词:派工法则、限制理论、系统资源、获利。
Thirdly, we use the two models to study the dynamic single-machine scheduling problem prmp and develop on-line optimal dispatching rules, which consider only available information 西北工业大学硕士论文摘妥第四,我们研究了一般费用函数问题1}r,,prmp}fma、的动态在线排序问题
In order to find the best fabrication control combination, this paper studied rework strategies to be applied in coordination with some commonly used dispatching rules at the photolithography stage 本文讨论在微影黄光区中几种再加工策略,并与常用的派工法则配合,期找出最适的生产控制组合。
Fourthly, we use the two models to study the dynamic single-machine scheduling problem prmp fmax and develop on-line optimal dispatching rules, which consider only available information 考虑该问题在中断一恢复和两种中断一安装重复模型下的单机动态排序问题,给出了在这几种模型下的只考虑当前可用信息的在线调度规则
Fifthly, we use the two models to study the dynamic single-machine scheduling problem rj, chains, prmp wj ( 1-e-acj ) and develop on-line optimal dispatching rules, which consider only available information r,,prec,pr呷}艺玛(l一。一ac“)的动态在线调度问题,同样给出了在中断一恢复和两种中断一安装重复模型下的只考虑当前可用信息的在线调度规则
According to the flood dispatching rules of shiquan reservoir, coordinated with the open-close program of the gates, the flood operation rules model is designed and developed, thus guiding the operation of the reservoir . ( 5 ) the study and development of real-time flood dispatching 根据石泉水库的调洪规则并结合闸门启闭程序开发设计调洪规则模型,以此指导水库运行;(5)洪水实时调度系统的研究与开发。
3 ) the on-line scheduling problem with constrains relationship is studied . we use generalized preemption models to study the dynamic single-machine scheduling problems of minimizing total weighted completion time and develop on-line optimal dispatching rules, which consider only available information 给出了在一般化可中断模型下,考虑任务之间存在优先约束关系时,具有任意的和未知的任务到达时间的最小化加权总完工时间的单机动态排序问题的在线调度规则。
In this approach, remaining operating time ( rot ) is divided into two types : one is relative rot, and the other is absolute rot . a new dispatching rule, i . e . the maximum relative rot of part is priority, is presented . this scheduling algorithm is proven to be effective by examples and theory analysis 论文重点研究了在单件、小批量生产方式下,基于启发式的作业车间调度问题,提出了优先分配启发式算法的一种新的优先分配规则,即相对剩余加工时间最大的概念,并从理论分析和软件实现两个方面验证了该算法的有效性。
This is the fundamental for latter study . according to the preempt-resume model, a statistic algorithm for p2 prmp cmax is given . secondly, we use the two models to study the dynamic single-machine scheduling problems of minimizing total flow time and of minimizing total timetable-length and develop on-line optimal dispatching rules, which consider only available information 第三,我们研究了排序问题1|r_j,prmp|somw_j(1-e~(-ac))的动态在线调度问题,考虑该问题在中断?重复和中断?安装重复模型下的动态在线排序问题,给出了只考虑当前可用信息的在线调度规则。
The main idea of this hybrid algorithm is : at first, all candidates in task collection is lined according to a dispatching rule ( earliest due date, edd ), then this linear queue is divided into some tiers under a criterion that partial order is not allowed to exist in the every tier, many feasible sequences is generated by constructing a neighborhood of a initial sequence in every tier, the allocation of the resources over time is conducted to perform every feasible task sequence, and a set of approximate optimal scheduling schemes is achieved as the precondition of the next tier ’ s disposal in meeting multiple scheduling objectives to obtain the global near-optimal schedule which makes these program run tier by tier until the last task is completed 该算法按照最早完工时间优先(ect)分派规则,先将参加排序的工序合并成一个串行序列,然后按照同层内不存在偏序关系的原则,将其分解为若干个时间上相互衔接的层次,在每个层次内部,通过构造邻域产生出多个可行序列,对每个可行序列进行设备配置,采用邻域搜索算法进行方案的寻优,保留一组满足评价要求的可行方案作为下一层设备配置的背景环境,通过层层递进最终获取全局的近似最优解。